SVM Venn Machine with k-Means Clustering
نویسندگان
چکیده
In this paper, we introduce a new method of designing Venn Machine taxonomy based on Support Vector Machines and k-means clustering for both binary and multi-class problems. We compare this algorithm to some other multi-probabilistic predictors including SVM Venn Machine with homogeneous intervals and a recently developed algorithm called Venn-ABERS predictor. These algorithms were tested on a range of real-world data sets. Experimental results are presented and discussed.
منابع مشابه
Modification of the Fast Global K-means Using a Fuzzy Relation with Application in Microarray Data Analysis
Recognizing genes with distinctive expression levels can help in prevention, diagnosis and treatment of the diseases at the genomic level. In this paper, fast Global k-means (fast GKM) is developed for clustering the gene expression datasets. Fast GKM is a significant improvement of the k-means clustering method. It is an incremental clustering method which starts with one cluster. Iteratively ...
متن کاملK-SVM: An Effective SVM Algorithm Based on K-means Clustering
Support Vector Machine (SVM) is one of the most popular and effective classification algorithms and has attracted much attention in recent years. As an important large margin classifier, SVM dedicates to find the optimal separating hyperplane between two classes, thus can give outstanding generalization ability for it. In order to find the optimal hyperplane, we commonly take most of the labele...
متن کاملA Peer to Peer Traffic Identification Method Using K-means Clustering, Svm & Genetic Algorithm
The utilization of shared (P2P) applications is developing significantly, which brings about a few major issues, for example, the system clog and traffic obstruction. Consequently P2P traffic identification is the most blazing theme of P2P traffic administration. Support vector machine (SVM) has points of interest with settling little examples for P2P characterization issues. However, the execu...
متن کاملValid Probabilistic Predictions for Ginseng with Venn Machines Using Electronic Nose
In the application of electronic noses (E-noses), probabilistic prediction is a good way to estimate how confident we are about our prediction. In this work, a homemade E-nose system embedded with 16 metal-oxide semi-conductive gas sensors was used to discriminate nine kinds of ginsengs of different species or production places. A flexible machine learning framework, Venn machine (VM) was intro...
متن کاملEntropy Reduction Based On K-Means Clustering And Neural Network/SVM Classifier
Clustering is the unsupervised learning problem. Better Clustering improves accuracy of search results and helps to reduce the retrieval time. Clustering dispersion known as entropy which is the disorderness that occur after retrieving search result. It can be reduced by combining clustering algorithm with the classifier. Clustering with weighted k-mean results in unlabelled data. This paper pr...
متن کامل